n = int(input())
if n ==2:
print("99999999900001")
print("1000000000")
else:
for i in range(n):
d = []
c = [1]
a = int(input())
l = list(map(int,input().split()))
k = list(map(int,input().split()))
for i,y in zip(l,k):
c.append(abs(i-y))
for i in range(a):
r = sorted([l[i],k[i],k[-1]])
if r[1]==k[-1]:
d.append(0)
break
elif k [-1]==r[0]:
d.append(abs(k[-1]-r[1]))
elif k[-1]==r[-1]:
d.append(abs(k[-1]-r[1]))
if k[-1] in k[:-1]:
d = []
break
if d ==[]:
print(sum(c))
else:
print(sum(c)+min(d))
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |